CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant Colony Optimization based Routing Techniques for VANET

With number of moving vehicles, vehicular Ad Hoc Network (VANET) is formed. These are provided with the wireless connections. Among various challenges in the VANET such as security and privacy of the messages, data forwarding is also considered as a major challenge. The effective communication is mainly depends on the how safely and fast the data is being forwarded among the vehicles. Data forw...

متن کامل

Omicron ACO. A New Ant Colony Optimization Algorithm

Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ant colonies that has been successful in the resolution of hard combinatorial optimization problems like the Traveling Salesman Problem (TSP). This paper proposes the Omicron ACO (OA), a novel population-based ACO alternative originally designed as an analytical tool. To experimentally prove OA advantages, thi...

متن کامل

An Efficient Ant Colony Optimization Clustering Algorithm

This paper presents a new algorithm for clustering which is called an “efficient ant colony optimization clustering algorithm” (EACOC) based on a classic algorithm “LF algorithm”. We have proved the algorithm efficiency when dealt with a big variety of different data as well as providing high quality and converging speed simultaneously. This is considered as the outcome of many changes we have ...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm

Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS ONE

سال: 2016

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0154080